Learning Graphical Models With Hypertree Structure Using a Simulated Annealing Approach
نویسندگان
چکیده
A major topic of recent research in graphical models has been to develop algorithms to learn them from a dataset of sample cases. However, most of these algorithms do not take into account that learned graphical models may be used for time-critical reasoning tasks and that in this case the time complexity of evidence propagation may have to be restricted, even if this can be achieved only by accepting approximations. In this paper we suggest a simulated annealing approach to learn graphical models with hypertree structure, with which the complexity of the popular join tree evidence propagation method can be controlled at learning time by restricting the size of the cliques of the learned network.
منابع مشابه
A Deterministic Annealing Approach to Learning Bayesian Networks
Graphical Models bring together two different mathematical areas: graph theory and probability theory. Recent years have witnessed an increase in the significance of the role played by Graphical Models in solving several machine learning problems. Graphical Models can be either directed or undirected. Undirected Graphical Models are also called Bayesian networks. The manual construction of Baye...
متن کاملLearning in Cross-layer Wireless Network Optimization
We study the use of learning for cross-layer optimization of wireless networks. In particular, we incorporate learning in the form of graphical models into our cognitive engine performing network utility maximization task using simulated annealing. Our results show that this learning approach can significantly accelerate the convergence rate of the optimizer, and help in adjusting to changes in...
متن کاملBayesian Learning in Sparse Graphical Factor Models via Variational Mean-Field Annealing
We describe a class of sparse latent factor models, called graphical factor models (GFMs), and relevant sparse learning algorithms for posterior mode estimation. Linear, Gaussian GFMs have sparse, orthogonal factor loadings matrices, that, in addition to sparsity of the implied covariance matrices, also induce conditional independence structures via zeros in the implied precision matrices. We d...
متن کاملMaximum Likelihood Markov Networks: An Algorithmic Approach
We show how a graphical model learning problem can be presented as a purely combinatorial problem. This allows us to analyze the computational hardness of the learning problem, and devise global optimization algorithms with proven performance guarantees. Markov networks are a class of graphical models that use an undirected graph to capture dependency information among random variables. Of part...
متن کاملUsing design of experiments approach and simulated annealing algorithm for modeling and Optimization of EDM process parameters
The main objectives of this research are, therefore, to assess the effects of process parameters and to determine their optimal levels machining of Inconel 718 super alloy. gap voltage, current, time of machining and duty factor are tuning parameters considered to be study as process input parameters. Furthermore, two important process output characteristic, have been evaluated in this research...
متن کامل